A fast iterative method for dominant points detection of digital curves
نویسندگان
چکیده
A new algorithm for detecting dominant points of digitized closed curves is presented. At first a process of localization of maximum curvature points is done. The method adds iteratively contour points as dominant points by a criterion that considers the distance of contour points respect to the set of dominant points calculated in previous steps. It follows a final process of refinement. The performance of our method are successfully compared with other dominant point extraction techniques. Finally, some examples of polygonal approximation are showed. Key–Words: Curvature, Digital Curve, Dominant Points, Polygonal Approximation.
منابع مشابه
A new iterative approach for dominant points extraction in planar curves
In this paper the problem of dominant point detection on digital curves is addressed. Based on an initial set of curvature points, our approach adds iteratively significant points by looking for the higher curvature contour points. The process continues until all the sums of the distances of contour points in the arcs subtended to the chord between two next dominant points is less then a predef...
متن کاملGeometric primitive feature extraction - concepts, algorithms, and applications
This thesis presents important insights and concepts related to the topic of the extraction of geometric primitives from the edge contours of digital images. Three specific problems related to this topic have been studied, viz., polygonal approximation of digital curves, tangent estimation of digital curves, and ellipse fitting anddetection from digital curves. For the problem of polygonal appr...
متن کاملOn the Detection of Visual Features from Digital Curves Using a Metaheuristic Approach
In computational shape analysis a crucial step consists in extracting meaningful features from digital curves. Dominant points are those points with curvature extreme on the curve that can suitably describe the curve both for visual perception and for recognition. Many approaches have been developed for detecting dominant points. In this paper we present a novel method that combines the dominan...
متن کاملThe detection of dominant points on digital curves by scale-space filtering
-The detection of dominant points is an important preprocessing step for shape recognition. An effective method of scale-space filtering with a Gaussian kernel is introduced to detect dominant points on digital curves. The conventional polygonal approximation algorithms are time-consuming and need input parameter tuning for Gaussian smoothing the noise and quantization error, also they are sens...
متن کاملA Fast and Accurate Expansion-Iterative Method for Solving Second Kind Volterra Integral Equations
This article proposes a fast and accurate expansion-iterative method for solving second kind linear Volterra integral equations. The method is based on a special representation of vector forms of triangular functions (TFs) and their operational matrix of integration. By using this approach, solving the integral equation reduces to solve a recurrence relation. The approximate solution of integra...
متن کامل